Implementation of active queue management in a combined input and output queued switch
نویسندگان
چکیده
This paper investigates the implementation of a class of active queue management algorithms (AQM) whose measure of congestion includes packet arrival rate, such as REM and GREEN, in a combined input and output queued (CIOQ) switch. We propose a structure with one AQM per output port and we analyze the constraints on the switch fabric speed that this imposes. A two queue model of a CIOQ switch is developed and simulated to validate our design and compare its performance with a droptail queue switch.
منابع مشابه
Stochastic Analysis of Stable Marriages in Combined Input Output Queued Switches
Traditionally, Output Queued switch architectures have been proposed to implement Quality of Service schemes such as Weighted Fair Queueing. Output Queued switches with N input and output ports require up to N serial memory operations per time slot (taken to be the time between packet arrivals at an input). Given the high and increasing processor/memory gap, it is important to shift the bottlen...
متن کاملA combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch
Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...
متن کاملPerformance of Prioritized i-SLIP Algorithm with Multiple Input Queued Switch
Input Queued Switch has throughput limitation of 58%.Hence concept of Virtual Output Queue is evolved. Selection of ‘N’ cells out of N is difficult task. Prof.Nick Mckeown from Stanford University had suggested i-slip algorithm to provide throughput of 100%. Multiple Input Queued Switch is generalized case of Input Queued Switch, where M indicates number of queues/port. When M=N, its VOQ. When ...
متن کاملA Delay Analysis of Maximal Matching Switching with Speedup
In this paper we analyze the average queue lengths in a combined input-output queued switch using a maximal size matching scheduling algorithm. We compare these average queue lengths to the average queue lengths achieved by an optimal switch. We model the cell arrival process as independent and identically distributed between time slots and uniformly distributed among input and output ports. Fo...
متن کاملPractical Scheduling Algorithms for Input - Queued
| The input-queued (IQ) switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. In this paper, two new algorithms, referred to as maximum credit rst (MCF) algorithm and iterative maximum credit rst (IMCF) algorithm, are introduced. Theo-retic analysis shows that the credits of an IQ switch using MCF are bounded for all admissible rate reser...
متن کامل